The Kelmans-Seymour conjecture II: 2-Vertices in K4−
نویسندگان
چکیده
منابع مشابه
The Kelmans-Seymour conjecture I: special separations
Seymour and, independently, Kelmans conjectured in the 1970s that every 5-connected nonplanar graph contains a subdivision of K5. This conjecture was proved by Ma and Yu for graphs containing K− 4 , and an important step in their proof is to deal with a 5separation in the graph with a planar side. In order to establish the Kelmans-Seymour conjecture for all graphs, we need to consider 5-separat...
متن کاملOn the Pósa-Seymour conjecture
Paul Seymour conjectured that any graph G of order n and minimum degree at least k k+1n contains the k th power of a Hamilton cycle. We prove the following approximate version. For any > 0 and positive integer k, there is an n0 such that, if G has order n ≥ n0 and minimum degree at least ( k k+1 + )n, then G contains the kth power of a Hamilton cycle. c © 1998 John Wiley & Sons, Inc. J Graph Th...
متن کاملEla the External Vertices Conjecture in Case
The determinantal conjecture of M. Marcus and G. N. de Oliveira is known in many special cases. The case of 3 × 3 matrices was settled by N. Bebiano, J. K. Merikoski and J. da Providência. The case n = 4 remains open. In this article a technical conjecture is established implying a weakened form of the determinantal conjecture for n = 4.
متن کاملFinite planar emulators for K4, 5-4K2 and K1, 2, 2, 2 and Fellows' Conjecture
In 1988 Fellows conjectured that if a finite, connected graph admits a finite planar emulator, then it admits a finite planar cover. We construct a finite planar emulator for K4,5 − 4K2. Archdeacon [Dan Archdeacon, Two graphswithout planar covers, J. Graph Theory, 41 (4) (2002) 318–326] showed that K4,5−4K2 does not admit a finite planar cover; thusK4,5−4K2 provides a counterexample to Fellows’...
متن کاملBipartite edge partitions and the former Alon-Saks-Seymour conjecture
A famous result of Graham and Pollak states that the complete graph with n vertices can be edge partitioned into n − 1, but no fewer, complete bipartite graphs. This result has led to the study of the relationship between the chromatic and biclique partition numbers of graphs. It has become even more exciting with recent connections to the clique versus stable set problem, communication protoco...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2020
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2019.11.007